Preconditioners for Saddle Point Problems on Truncated Domains in Phase Separation Modelling
نویسنده
چکیده
The discretization of Cahn-Hilliard equation with obstacle potential leads to a block 2ˆ2 non-linear system, where the p1, 1q block has a non-linear and non-smooth term. Recently a globally convergent Newton Schur method was proposed for the non-linear Schur complement corresponding to this non-linear system. The solver may be seen as an inexact Uzawa method which has the falvour of an active set method in the sense that the active sets are first identified by solving a quadratic obstacle problem corresponding to the p1, 1q block of the block 2ˆ2 nonlinear system, and a new decent direction is obtained after discarding the active set region. The problem becomes linear on nonactive set, and corresponds to solving a linear saddle point problem on truncated domains. For solving the quadratic obstacle problem, various optimal multigrid like methods have been proposed. In this paper solvers for the truncated saddle point problem is considered. Three preconditioners are considered, two of them have block diagonal structure, and the third one has block tridiagonal structure. One of the block diagonal preconditioners is obtained by adding certain scaling of stiffness and mass matrices, whereas, the remaining two involves Schur complement. Eigenvalue bound and condition number estimates are derived for the preconditioned untruncated problem. It is shown that the extreme eigenvalues of the preconditioned truncated system remain bounded by the extreme eigenvalues of the preconditioned untruncated system. Numerical experiments confirm the optimality of the solvers.
منابع مشابه
Preconditioners for regularized saddle point problems with an application for heterogeneous Darcy flow problems
Saddle point problems arise in the modelling of many important practical problems. Preconditioners for the corresponding matrices on block triangular form, based on coupled inner-outer iteration methods are analyzed and applied to a Darcy flow problem, possibly with strong heterogeneity and to non-symmetric saddle point problems. Using proper regularized forms of the given matrix and its precon...
متن کاملTwo preconditioners for saddle point problems in fluid flows
In this paper two preconditioners for the saddle point problem are analysed: one based on the augmented Lagrangian approach and another involving artificial compressibility. Eigenvalue analysis shows that with these preconditioners small condition numbers can be achieved for the preconditioned saddle point matrix. The preconditioners are compared with commonly used preconditioners from literatu...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملOptimization of the parameterized Uzawa preconditioners for saddle point matrices
The parameterized Uzawa preconditioners for saddle point problems are studied in this paper. The eigenvalues of the preconditioned matrix are located in (0, 2) by choosing the suitable parameters. Furthermore, we give two strategies to optimize the rate of convergence by finding the suitable values of parameters. Numerical computations show that the parameterized Uzawa preconditioners can lead ...
متن کاملEfficient Preconditioners Based on Fictitious Domains for Elliptic Fe{problems with Lagrange Multipliers Eecient Preconditioners Based on Ctitious Domains for Elliptic Fe{problems with Lagrange Multipliers
The macro{hybrid formulation based on domain decomposition is considered for elliptic boundary value problems with both symmetric positive deenite and indeenite operators. The problem is discretized by the mortar element method, which leads to a large{scale sparse linear system with a saddle{ point matrix. In the case of symmetric and positive deenite operators, a block diagonal preconditioner ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.10339 شماره
صفحات -
تاریخ انتشار 2017